Shortest cycle covers and cycle double covers with large 2-regular subgraphs

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Shortest cycle covers and cycle double covers with large 2-regular subgraphs

In this paper we show that many snarks have shortest cycle covers of length 43m + c for a constant c, where m is the number of edges in the graph, in agreement with the conjecture that all snarks have shortest cycle covers of length 43m+ o(m). In particular we prove that graphs with perfect matching index at most 4 have cycle covers of length 4 3m and satisfy the (1, 2)-covering conjecture of Z...

متن کامل

A note about shortest cycle covers

Let G be a graph with odd edge-connectivity r. It is proved in this paper that if r > 3, then G has a 3-cycle (1, 2)-cover of total length at most ((r + 1)|E(G)|)/r . © 2005 Elsevier B.V. All rights reserved.

متن کامل

Flows, flow-pair covers and cycle double covers

In this paper, some earlier results by Fleischner [H. Fleischner, Bipartizing matchings and Sabidussi’s compatibility conjecture, DiscreteMath. 244 (2002) 77–82] about edge-disjoint bipartizingmatchings of a cubic graphwith a dominating circuit are generalized for graphs without the assumption of the existence of a dominating circuit and 3-regularity. A pair of integer flows (D, f1) and (D, f2)...

متن کامل

Cycle double covers and spanning minors I

Define a graph to be a Kotzig graph if it is m-regular and has an m-edge colouring in which each pair of colours form a Hamiltonian cycle. We show that every cubic graph with spanning subgraph consisting of a subdivision of a Kotzig graph together with even cycles has a cycle double cover, in fact a 6-CDC. We prove this for two other families of graphs similar to Kotzig graphs as well. In parti...

متن کامل

Cycle double covers and spanning minors II

In this paper we continue our investigations from [HM01] regarding spanning subgraphs which imply the existence of cycle double covers. We prove that if a cubic graph G has a spanning subgraph isomorphic to a subdivision of a bridgeless cubic graph on at most 10 vertices then G has a CDC. A notable result is thus that a cubic graph with a spanning Petersen minor has a CDC, a result also obtaine...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Journal of Combinatorics

سال: 2013

ISSN: 2156-3527,2150-959X

DOI: 10.4310/joc.2013.v4.n4.a5